An extensional treatment of dataflow deadlock
نویسندگان
چکیده
منابع مشابه
An Extensional Treatment of Dataflow Deadlock
We discuss deadlock in reference to a simple equational dataflow language, and devise a test (the cycle sum test) which is applied to the dependency graph of a program. We use Kahn’s extensional semantics of dataflow and give a purely extensional (non-operational) proof that no program passing the cycle sum test can ever deadlock. The proof is based on the notions of size (length) and completen...
متن کاملAn Extensional Böhm Model
We show the existence of an infinitary confluent and normalising extension of the finite extensional lambda calculus with beta and eta. Besides infinite beta reductions also infinite eta reductions are possible in this extension, and terms without head normal form can be reduced to bottom. As corollaries we obtain a simple, syntax based construction of an extensional Böhm model of the finite la...
متن کاملAnatomy of an Extensional Collapse
We prove that, in the hierarchy of simple types, the set-theoretic coherence semantics is the exten-sional collapse of the multiset-theoretic coherence semantics.
متن کاملAn Efficient Deadlock
Over the years several locking protocols have been proposed for coordinating the concurrent use of a data base by multiple transactions. Of these, the non-two-phase locking (non-2PL) protocols form a large class. The Pitfall Protocol (PP) is one of the non-2PL protocols. While the rules of PP assure serializability, they do not prevent deadlocks from occurring. Resolution of a deadlock by parti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1981
ISSN: 0304-3975
DOI: 10.1016/0304-3975(81)90108-0